On the General Position Subset Selection Problem
نویسندگان
چکیده
منابع مشابه
On the general position subset selection problem
Let f(n, l) be the maximum integer such that every set of n points in the plane with at most l collinear contains a subset of f(n, l) points with no three collinear. First we prove that if l 6 O( √ n) then f(n, l) > Ω( √ n ln l ). Second we prove that if l 6 O(n) then f(n, l) > Ω( √ n logl n), which implies all previously known lower bounds on f(n, l) and improves them when l is not fixed. A mo...
متن کاملAn improved lower bound for general position subset selection
In the General Position Subset Selection (GPSS) problem, the goal is to find the largest possible subset of a set of points, such that no three of its members are collinear. If sGPSS is the size the optimal solution, √ sGPSS is the current best guarantee for the size of the solution obtained using a polynomial time algorithm. In this paper we present an algorithm for GPSS to improve this bound ...
متن کاملOn Subset Selection with General Cost Constraints
This paper considers the subset selection problem with a monotone objective function and a monotone cost constraint, which relaxes the submodular property of previous studies. We first show that the approximation ratio of the generalized greedy algorithm is α2 (1 − 1 eα ) (where α is the submodularity ratio); and then propose POMC, an anytime randomized iterative approach that can utilize more ...
متن کاملIrrelevant Features and the Subset Selection Problem
We address the problem of nding a subset of features that allows a supervised induc tion algorithm to induce small high accuracy concepts We examine notions of relevance and irrelevance and show that the de nitions used in the machine learning literature do not adequately partition the features into useful categories of relevance We present de ni tions for irrelevance and for two degrees of rel...
متن کاملThe graph theory general position problem on some interconnection networks
Given a graph G, the (graph theory) general position problem is to find the maximum number of vertices such that no three vertices lie on a common geodesic. This graph invariant is called the general position number (gpnumber for short) of G and denoted by gp(G). In this paper, the gp-number is determined for a large class of subgraphs of the infinite grid graph and for the infinite diagonal gr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Discrete Mathematics
سال: 2013
ISSN: 0895-4801,1095-7146
DOI: 10.1137/120897493